Relations between the Rank and the Crank
نویسنده
چکیده
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
منابع مشابه
ON THE NUMBER OF EVEN AND ODD STRINGS ALONG THE OVERPARTITIONS OF n
A partition of a non-negative integer n is a non-increasing sequence of positive integers whose sum is n. For example, The 5 partitions of 4 are 4, 3 + 1, 2 + 2, 2 + 1 + 1, and 1 + 1 + 1 + 1. To explain Ramanujan’s famous three partition congruences, the partition statistics, the rank (resp. the crank) were introduced by Dyson [8] (resp. Andrews and Garvan [3]). Atkin and Garvan [5] initiated t...
متن کاملRank and Crank Moments for Overpartitions
We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in terms of quasimodular forms. We then use this fact to prove exact relations involving the moments as well as congruence properties modulo 3, 5, and 7 for som...
متن کاملCongruences for Andrews’ Smallest Parts Partition Function and New Congruences for Dyson’s Rank
Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We prove a generalization of these congruences using known relations between rank and crank moments. We obtain an explicit Ramanujan-type congruence for spt(n) ...
متن کاملHigher Order Spt-functions
Andrews’ spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only known previously for sufficiently large n and...
متن کاملNumerical solution of the one dimensional non-linear Burgers equation using the Adomian decomposition method and the comparison between the modified Local Crank-Nicolson method and the VIM exact solution
The Burgers’ equation is a simplified form of the Navier-Stokes equations that very well represents their non-linear features. In this paper, numerical methods of the Adomian decomposition and the Modified Crank – Nicholson, used for solving the one-dimensional Burgers’ equation, have been compared. These numerical methods have also been compared with the analytical method. In contrast to...
متن کامل